Determiners, Adjectives and a Query of van Benthem’s

نویسنده

  • Edward L. Keenan
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

German Quantifiers: Determiners or Adjectives?

In this paper, I address the categorial status of quantifiers and similar expressions in German. Traditionally, they are assigned either of two classes: determiners and adjectives. I argue that German quantifiers in principle are ambiguous and can be realized alternatively as determiners or adjectives. The categorial status is mirrored by the declension of attributive adjectives following these...

متن کامل

Morpho-Syntactic Agreement and Index Agreement in Dutch NPs

For the treatment of agreement in Dutch NPs I adopt a distinction, familiar from HPSG, between morphosyntactic agreement and index agreement. In order to determine their respective roles, I make another distinction, proposed in Van Eynde (2003), between marked and unmarked nominals. Employing these distinctions, I will demonstrate that the combination of prenominal adjectives and determiners wi...

متن کامل

Q-Adjectives and the Semantics of Quantity

The adjectives of quantity (Q-adjectives) many, few, much and little stand out from other quantity expressions on account of their syntactic flexibility, occurring in positions that could be called quantificational (many students attended), predicative (John’s friends were many), attributive (the many students), differential (much more than a liter) and adverbial (slept too much). This broad di...

متن کامل

On the Dynamics of Conversation∗

There is a longstanding debate in the literature about static versus dynamic approaches to meaning and conversation. A formal result due to van Benthem (1986, 1996) is often thought to be important for understanding what, conceptually speaking, is at issue in the debate. We introduce the concept of a conversation system, and we use it to clarify the import of van Benthem’s result. We then disti...

متن کامل

Yde Venema Representation of Game Algebras

We prove that every abstractly defined game algebra can be represented as an algebra of consistent pairs of monotone outcome relations over a game board. As a corollary we obtain Goranko’s result that van Benthem’s conjectured axiomatization for equivalent game terms is indeed complete.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999